package problem377;

//377.组合总数4
//https://leetcode.cn/problems/combination-sum-iv/

class Solution {
    public int combinationSum4(int[] nums, int target) {
        int[] dp = new int[target+1];
        dp[0] = 1;
        for(int i = 1; i<=target; i++) {
            for(int x:nums) {
                if(i-x>=0) dp[i] += dp[i-x];
            }
        }
        return dp[target];
    }
}

/*
dp[i]:凑成i, 总共有多少种排列数

*/